array vt. 1.打扮,裝飾。 2.使…列隊,排列。 3.提出(陪審官)名單,使(陪審官)列席,召集(陪審官)。 The general arrayed his troops for battle. 將軍使軍隊列隊準備戰(zhàn)斗。 The girl arrayed herself in her finest clothes. 這女孩打扮得花枝招展。 The count and his men arrayed themselves against the king. 伯爵舉兵對抗國王。 n. 1.整列,隊列,陣(列);陣容。 2.〔詩〕衣裳,裝扮,打扮。 3.陪審官名單。 4.一大批,一大群,一連串。 5.【數(shù)學(xué)】排列。 a battle array 戰(zhàn)斗隊形,列陣。 holiday array 節(jié)日盛裝。 be in fine array 盛裝。 an array of actors 演員的陣容。 a window array 櫥窗陳列品。 an array of (umbrellas) 一排(傘)。 in battle array 列陣,嚴陣。 in proud array 堂堂正正。
Square brackets denote a numerically indexed array 方括號表示數(shù)字索引數(shù)組。
And indexed array access properties 和索引數(shù)組訪問屬性表示。
Represents an indexed array, so its 代表索引數(shù)組,所以它的
Except that it appends its value to an indexed array identified by the key 類似,區(qū)別在于它把值添加到按照鍵進行識別的索引數(shù)組。
Split s job is to " chop up " a string and place the various parts into an integer-indexed array split()的任務(wù)是“切開”字符串,并將各部分放到使用整數(shù)下標的數(shù)組中。
Under the hood, javascript objects for the most part are composed of associative arrays, numerically indexed arrays, strings, numbers, or nested combinations of these types 實際上,javascript對象的大部分都由聯(lián)合數(shù)組、數(shù)字索引數(shù)組、字符串、數(shù)字或者這些類型的嵌套組合而成。
We define the mapping a on circle in double quiver q of a quiver q, and give a strict defition of bracket operation in lie algebra, then prove it is a lie bracket . in section 1.2, we introduce the left and right index arrays of an necklace word 1節(jié)中,我們定義了箭圖q的重箭圖(?)循環(huán)上的映射,用它給出了項鏈李代數(shù)括號運算的一個嚴格定義,并用此定義證明了這是一個李運算。在1
Using them, we divided the necklace words into 5 classes, namely : a, b, c, d and e . we also discuss a natural involution of necklace lie algebra . in section 1.3, taking the advantage of the classification by the index arrays, pointed out the space spanned by class a, b, c respect ! vivety are subalgebras of nq 2節(jié)中,我們對項鏈字引入左右指標數(shù)組,利用它們把項鏈李代數(shù)n_q的基分成了a,b,c,d,e5類。我們還討論了由重箭圖自然自同構(gòu)導(dǎo)出的李代數(shù)的一個自然的對合。在1
In section 2.2, we prove that if the set of arrows in a quiver is not empty, then nq is not semisimple . we construct the nonsovable subalgebra of nq when there is no less than one circle whose length is bigger than one, and there is no loop in quiver q, thus leads to a conclusion that nq is nonsovable . using the index arrays to discuss the operation of necklace word . construct a sovable subalgebra of nq, which is not nilpotent . this shows that nq is not nilpotent provided that there is a cyclic with length bigger than 1 當(dāng)箭圖中有長度大于1的循環(huán),且無圈時,構(gòu)造了n_q的非可解子代數(shù),從而證明了n_q是不可解李代數(shù)。我們還利用指標數(shù)組討論了項鏈字的運算,構(gòu)造了n_q的可解非冪零子代數(shù),從而證明了當(dāng)箭圖中有長度大于1的循環(huán)時,項鏈李代數(shù)非冪零。在2